A robust class of linear recurrence sequences
نویسندگان
چکیده
We introduce a subclass of linear recurrence sequences which we call poly-rational because they are denoted by rational expressions closed under sum and product. show that this class is robust giving several characterisations: polynomially ambiguous weighted automata, copyless cost-register formal series, whose eigenvalues roots numbers.
منابع مشابه
Zeros of linear recurrence sequences
Let f (x) = P0(x)α 0 + · · · + Pk(x)α k be an exponential polynomial over a field of zero characteristic. Assume that for each pair i, j with i 6= j , αi/αj is not a root of unity. Define 1 = ∑kj=0(deg Pj +1). We introduce a partition of {α0, . . . , αk} into subsets { αi0, . . . , αiki } (1 ≤ i ≤ m), which induces a decomposition of f into f = f1 +· · ·+fm, so that, for 1 ≤ i ≤ m, (αi0 : · · ·...
متن کاملPalindromes in Linear Recurrence Sequences
We prove that for any base b ≥ 2 and for any linear homogeneous recurrence sequence {an}n≥1 satisfying certain conditions, there exits a positive constant c > 0 such that #{n ≤ x : an is palindromic in base b} x1−c.
متن کاملOn Nearly Linear Recurrence Sequences
A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,. . ., Ad−1 such that the sequence ( an+d + Ad−1an+d−1 + · · · + A0an )∞ n=0 is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (ãn) associated with it and prove under certain assumptions...
متن کاملOn the multiplicity of linear recurrence sequences
We prove a lemma regarding the linear independence of certain vectors and use it to improve on a bound due to Schmidt on the zero-multiplicity of linear recurrence sequences. 1 Linear recurrence sequences Let {un}n∈Z be a linear recurrence sequence of complex numbers satisfying the recurrence relation un = c1un−1 + · · ·+ ctun−t, (1) for c1, . . . , ct ∈ C with ct 6= 0. We say it is of order t ...
متن کاملAsymptotic Positiveness of Linear Recurrence Sequences
Suppose that the first several terms of a sequence are given, then it is not so easy to predict the asymptotic behavior of this sequence. But once we know that this given sequence is a linear recurrence sequence, we can determine the asymptotic behavior through its recurrence formula. Indeed, John R. Burke and William A. Webb [1] considered real linear recurrence sequences iun}TM=Q of order d d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2022
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2022.104964